HAMSTRINGS, QUADRICEPS, AND GLUTEAL MUSCLE ACTIVATION DURING RESISTANCE TRAINING EXERCISES

This study evaluated hamstrings, quadriceps, and gluteal muscles activation during the back squat, deadlift, step-up, and lunge. Root mean square electromyographical data were analyzed for the eccentric and concentric phases during each exercise. Subjects included 16 women who performed 2 repetitions of each of the exercises at a 6 repetition maximum load. A repeated measures ANOVA revealed significant main effects (P≤0.05) representing differences in muscle activation between the resistance training exercises all muscle groups (P≤0.05) except for the rectus femoris, during the concentric phase (P=0.22). Based on these results, resistance training exercises can be prescribed based on how they best train the desired musculature

KINETIC ANALYSIS OF LOWER BODY RESISTANCE TRAINING EXERCISES

This study evaluated and compared the peak vertical ground reaction force (GRF) and rate of force development (RFD) for the eccentric and concentric phases of 4 lower body resistance training exercises, including the back squat, deadlift, step-up, and forward lunge. Sixteen women performed 2 repetitions of each of the 4 exercises at a 6 repetition maximum load. Kinetic data were acquired using a force platform. A repeated measures ANOVA was used to evaluate the differences in GRF between the exercises. Results revealed significant main effects for GRF both the eccentric (p ≤ 0.001) and concentric (p ≤ 0.001) phases. Significant main effects were also found for RFD for the eccentric (p ≤ 0.001) and concentric phases (p ≤ 0.001). Force and power requirements and osteogenic potential differ between these resistance training exercises

ANTAGONIST CONDITIONING CONTRACTIONS IMPAIR AGONIST FUNCTIONING

This study assessed the effect of antagonist conditioning contractions (ACC) on the subsequent force and electromyography of an agonist. Twelve subjects performed isokinetic elbow flexion on a dynamometer in 4 test conditions including a baseline condition without, and 1, 3 and 6 seconds after, isometric triceps extension. Average peak torque (T), peak torque/body weight (T:BW), average power (P), and rate of torque development (RTD) were assessed. Electromyographic data were obtained from elbow extensors and flexors. A repeated measures ANOVA with post hoc analysis demonstrated that T, T:BW, P, and RTD were higher in the baseline, compared to the post ACC conditions (P ≤ 0.05), and appears to be due to higher brachioradialis activation in the baseline condition in compared to some post ACC conditions (P ≤ 0.05)

OMA 2011: orthology inference among 1000 complete genomes

OMA (Orthologous MAtrix) is a database that identifies orthologs among publicly available, complete genomes. Initiated in 2004, the project is at its 11th release. It now includes 1000 genomes, making it one of the largest resources of its kind. Here, we describe recent developments in terms of species covered; the algorithmic pipeline—in particular regarding the treatment of alternative splicing, and new features of the web (OMA Browser) and programming interface (SOAP API). In the second part, we review the various representations provided by OMA and their typical applications. The database is publicly accessible at http://omabrowser.org

Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation

<p>Abstract</p> <p>Background</p> <p>The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest approach to parallelisation with SIMD technology has previously been described by Farrar in 2007. The aim of this study was to explore whether further speed could be gained by other approaches to parallelisation.</p> <p>Results</p> <p>A faster approach and implementation is described and benchmarked. In the new tool SWIPE, residues from sixteen different database sequences are compared in parallel to one query residue. Using a 375 residue query sequence a speed of 106 billion cell updates per second (GCUPS) was achieved on a dual Intel Xeon X5650 six-core processor system, which is over six times more rapid than software based on Farrar's 'striped' approach. SWIPE was about 2.5 times faster when the programs used only a single thread. For shorter queries, the increase in speed was larger. SWIPE was about twice as fast as BLAST when using the BLOSUM50 score matrix, while BLAST was about twice as fast as SWIPE for the BLOSUM62 matrix. The software is designed for 64 bit Linux on processors with SSSE3. Source code is available from <url>http://dna.uio.no/swipe/</url> under the GNU Affero General Public License.</p> <p>Conclusions</p> <p>Efficient parallelisation using SIMD on standard hardware makes it possible to run Smith-Waterman database searches more than six times faster than before. The approach described here could significantly widen the potential application of Smith-Waterman searches. Other applications that require optimal local alignment scores could also benefit from improved performance.</p

Normal radial migration and lamination are maintained in dyslexia-susceptibility candidate gene homolog Kiaa0319 knockout mice

AbstractDevelopmental dyslexia is a common disorder with a strong genetic component, but the underlying molecular mechanisms are still unknown. Several candidate dyslexia-susceptibility genes, including KIAA0319, DYX1C1, and DCDC2, have been identified in humans. RNA interference experiments targeting these genes in rat embryos have shown impairments in neuronal migration, suggesting that defects in radial cortical migration could be involved in the disease mechanism of dyslexia. Here we present the first characterisation of a Kiaa0319 knockout mouse line. Animals lacking KIAA0319 protein do not show anatomical abnormalities in any of the layered structures of the brain. Neurogenesis and radial migration of cortical projection neurons are not altered, and the intrinsic electrophysiological properties of Kiaa0319-deficient neurons do not differ from those of wild-type neurons. Kiaa0319 overexpression in cortex delays radial migration, but does not affect final neuronal position. However, knockout animals show subtle differences suggesting possible alterations in anxiety-related behaviour and in sensorimotor gating. Our results do not reveal a migration disorder in the mouse model, adding to the body of evidence available for Dcdc2 and Dyx1c1 that, unlike in the rat in utero knockdown models, the dyslexia-susceptibility candidate mouse homolog genes do not play an evident role in neuronal migration. However, KIAA0319 protein expression seems to be restricted to the brain, not only in early developmental stages but also in adult mice, indicative of a role of this protein in brain function. The constitutive and conditional knockout lines reported here will be useful tools for further functional analyses of Kiaa0319

CUDASW++2.0: enhanced Smith-Waterman protein database search on CUDA-enabled GPUs based on SIMT and virtualized SIMD abstractions

<p>Abstract</p> <p>Background</p> <p>Due to its high sensitivity, the Smith-Waterman algorithm is widely used for biological database searches. Unfortunately, the quadratic time complexity of this algorithm makes it highly time-consuming. The exponential growth of biological databases further deteriorates the situation. To accelerate this algorithm, many efforts have been made to develop techniques in high performance architectures, especially the recently emerging many-core architectures and their associated programming models.</p> <p>Findings</p> <p>This paper describes the latest release of the CUDASW++ software, CUDASW++ 2.0, which makes new contributions to Smith-Waterman protein database searches using compute unified device architecture (CUDA). A parallel Smith-Waterman algorithm is proposed to further optimize the performance of CUDASW++ 1.0 based on the single instruction, multiple thread (SIMT) abstraction. For the first time, we have investigated a partitioned vectorized Smith-Waterman algorithm using CUDA based on the virtualized single instruction, multiple data (SIMD) abstraction. The optimized SIMT and the partitioned vectorized algorithms were benchmarked, and remarkably, have similar performance characteristics. CUDASW++ 2.0 achieves performance improvement over CUDASW++ 1.0 as much as 1.74 (1.72) times using the optimized SIMT algorithm and up to 1.77 (1.66) times using the partitioned vectorized algorithm, with a performance of up to 17 (30) billion cells update per second (GCUPS) on a single-GPU GeForce GTX 280 (dual-GPU GeForce GTX 295) graphics card.</p> <p>Conclusions</p> <p>CUDASW++ 2.0 is publicly available open-source software, written in CUDA and C++ programming languages. It obtains significant performance improvement over CUDASW++ 1.0 using either the optimized SIMT algorithm or the partitioned vectorized algorithm for Smith-Waterman protein database searches by fully exploiting the compute capability of commonly used CUDA-enabled low-cost GPUs.</p

VDA, a Method of Choosing a Better Algorithm with Fewer Validations

The multitude of bioinformatics algorithms designed for performing a particular computational task presents end-users with the problem of selecting the most appropriate computational tool for analyzing their biological data. The choice of the best available method is often based on expensive experimental validation of the results. We propose an approach to design validation sets for method comparison and performance assessment that are effective in terms of cost and discrimination power